Locating any two vertices on Hamiltonian cycles in large graphs
نویسندگان
چکیده
منابع مشابه
Distributing vertices on Hamiltonian cycles
Let G be a graph of order n and 3 ≤ t ≤ n4 be an integer. Recently, Kaneko and Yoshimoto provided a sharp δ(G) condition such that for any set X of t vertices, G contains a hamiltonian cycle H so that the distance along H between any two vertices of X is at least n/2t. In this paper, minimum degree and connectivity conditions are determined such that for any graph G of sufficiently large order ...
متن کاملPrecise location of vertices on Hamiltonian cycles
Given k ≥ 2 fixed positive integers p1, p2, . . . , pk−1 ≥ 2, and k vertices {x1, x2, . . . , xk}, let G be a simple graph of sufficiently large order n. It is proved that if δ(G) ≥ (n+ 2k− 2)/2, then there is a Hamiltonian cycle C of G containing the vertices in order such that the distance along C is dC (xi, xi+1) = pi for 1 ≤ i ≤ k − 1. Also, let {(xi, yi)|1 ≤ i ≤ k} be a set of k disjoint p...
متن کاملHamiltonian Cycles on Symmetrical Graphs
The edges of highly-connected symmetrical graphs are colored so that they form Hamiltonian cycles. As an introduction we discuss the coloring of the complete graphs K2m+1 for m>1, but the focus is on the graphs resulting from symmetrical perspective projections of the edges of the regular 4-dimensional polytopes into 3-space. The goal is to color all edges in these graphs with multiple congruen...
متن کاملOn certain Hamiltonian cycles in planar graphs
The problem is considered under which conditions a 4-connected planar or projective planar graph has a Hamiltonian cycle containing certain prescribed edges and missing certain forbidden edges. The results are applied to obtain novel lower bounds on the number of distinct Hamiltonian cycles that must be present in a 5-connected graph that is embedded into the plane or into the projective plane ...
متن کاملLong Cycles in Hamiltonian Graphs
We prove that if an n-vertex graph with minimum degree at least 3 contains a Hamiltonian cycle, then it contains another cycle of length n− o(n); in particular, this verifies, in an asymptotic form, a well-known conjecture due to Sheehan from 1975.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2020
ISSN: 0012-365X
DOI: 10.1016/j.disc.2020.111941